package ch4_BinaryTree;

//二叉树节点
public class BTNode {
	private char value;
	private BTNode left, right;

	public BTNode(char value) {
		this(value, null, null);
	}

	public BTNode(char value, BTNode left, BTNode right) {
		this.value = value; 
		this.left = left;
		this.right = right;
	}

	public char getValue() {
		return value;
	}

	public void setValue(char key) { 
		this.value = key;
	}

	public BTNode getLeft() {
		return left;
	}

	public BTNode getRight() {
		return right;
	}

	public void setLeft(BTNode left) {
		this.left = left;
	}

	public void setRight(BTNode right) {
		this.right = right;
	}
}
